Performance Analysis of Parallel Pollard's Rho Algorithm

Integer factorization is one of the vital algorithms discussed as a part of analysis of any black-box cipher suites where the cipher algorithm is based on number theory. The origin of the problem is from Discrete Logarithmic Problem which appears under the analysis of the cryptographic algorithms as seen by a cryptanalyst. The integer factorization algorithm poses a potential in computational science too, obtaining the factors of a very large number is challenging with a limited computing infrastructure. This paper analyses the Pollard’s Rho heuristic with a varying input size to evaluate the performance under a multicore environment and also to estimate the threshold for each computing infrastructure.